Maximum theorem - PDFSEARCH.IO - Document Search Engine

Maximum theorem
Results: 107

#	Item
11	Colouring Graphs When the Number of Colours is Almost the Maximum Degree∗ Michael Molloy Dept of Computer Science, University of Toronto 10 Kings College Rd. Toronto, ON, Canada, M5S 3G4 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2011-01-05 22:31:04 Graph coloring Graph theory Graph operations Clique Degree Neighbourhood Graph Perfect graph theorem Extremal graph theory
12	2 Bias-correction of Kalman filter estimators associated to a linear state space model with estimated parameters 3 Add to Reading List Source URL: ria.ua.pt Language: English - Date: 2016-05-13 08:38:39 Estimation theory Estimator Kalman filter Minimum mean square error Maximum likelihood estimation Bias of an estimator Mean squared error Point estimation GaussMarkov theorem Extended Kalman filter Efficient estimator
13	On Consistent Migration of Flows in SDNs Sebastian Brandt Klaus-Tycho Foerster∗ Roger Wattenhofer Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2016-01-21 09:22:35 Network flow Graph theory Mathematics Operations research Flow network Multi-commodity flow problem Maximum flow problem Max-flow min-cut theorem Traffic flow Linear programming Approximate max-flow min-cut theorem Circulation problem
14	Social Learning in a Changing World Rafael M. Frongillo∗, Grant Schoenebeck† and Omer Tamuz‡ arXiv:1109.5482v1 [cs.SI] 26 SepSeptember 27, 2011 Add to Reading List Source URL: people.hss.caltech.edu Language: English - Date: 2012-03-08 06:42:19 Statistics Estimation theory Statistical theory Bias of an estimator GaussMarkov theorem Covariance Variance Maximum likelihood estimation Kalman filter Expected value Efficiency Estimator
15	MAXIMUM ENTROPY GAUSSIAN APPROXIMATIONS FOR THE NUMBER OF INTEGER POINTS AND VOLUMES OF POLYTOPES Alexander Barvinok and J.A. Hartigan January 2010 Add to Reading List Source URL: www.math.lsa.umich.edu Language: English - Date: 2010-01-19 13:40:01 Statistics Mathematical analysis Probability Probability distributions Information theory Randomness Infinitely divisible probability distributions Normal distribution Central limit theorem Entropy Geometric distribution Expected value
16	THEOREM OF THE DAY Vizing’s Theorem A simple graph of maximum degree ∆ has chromatic index ∆ or ∆ + 1. An edge colouring assigns a colour to each edge of a graph G in such a way that no incident edges are assign Add to Reading List Source URL: www.theoremoftheday.org Language: English - Date: 2015-11-29 07:25:58
17	PDF Document Add to Reading List Source URL: genome.sph.umich.edu Language: English - Date: 2013-03-01 02:22:25 Estimation theory Statistics Statistical theory Statistical inference Minimum-variance unbiased estimator Bias of an estimator RaoBlackwell theorem Estimator CramrRao bound Efficient estimator Maximum likelihood estimation
18	Bayesian Posterior Sampling via Stochastic Gradient Fisher Scoring Sungjin Ahn Dept. of Computer Science, UC Irvine, Irvine, CA, USA SUNGJIA @ ICS . UCI . EDU Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2012-05-22 12:55:14 Fisher information Markov chain Monte Carlo Normal distribution Stochastic gradient descent Maximum a posteriori estimation Confidence interval Central limit theorem Score Expectation–maximization algorithm Statistics Estimation theory Maximum likelihood
19	Lecture notes for “Analysis of Algorithms”: Global minimum cuts (Draft) Lecturer: Uri Zwick ∗ Add to Reading List Source URL: www.cs.tau.ac.il Language: English - Date: 2011-01-18 10:58:41 Theoretical computer science Graph connectivity Network flow Cut Randomized algorithm Max-flow min-cut theorem Maximum flow problem Connectivity Minimum cut Graph theory Mathematics Combinatorial optimization
20	Economics Letters–291 Berge’s maximum theorem with two topologies on the action set a, a b Add to Reading List Source URL: faculty.insead.edu - Date: 2006-04-07 10:19:12

UPDATE